Programming language theory and its implementation - applicative and imperative paradigms
نویسنده
چکیده
ions The description of the meaning of expressions just given above is vague and intuitive It took about years for logicians Dana Scott in fact to make it rigorous in a useful way We shall not be going into details of this Example x x denotes the identity function x x E E Example x f f x denotes the function which when applied to E yields f f x E x i e f f E This is the function which when applied to E yields f E E f i e E E Thus
منابع مشابه
1 Evaluating the Performance of a SISAL implementation of the Abingdon Cross Image Processing
There are many paradigms being promoted and explored for programming parallel computers, including modified sequential languages, new imperative languages and applicative languages. SISAL is an applicative language which has been designed by a consortium of industrial and research organisations for the specification and execution of parallel programs. It allows programs to be written with littl...
متن کاملAn Extensional Metalanguage with I/o and a Dynamic Store (extended Abstract)
We introduce a typed metalanguage based on PCF that includes I/O and store operations. We give an applicative characterization of operational equivalence for this language. Finally, we give an example of a translation from an imperative programming language into our metalanguage, and we demonstrate how to use the theory of the metalanguage to reason about terms in the source programming language.
متن کاملAn Applicative Control-Flow Graph Based on Huet's Zipper
We are using ML to build a compiler that does low-level optimization. To support optimizations in classic imperative style, we built a control-flow graph using mutable pointers and other mutable state in the nodes. This decision proved unfortunate: the mutable flow graph was big and complex, and it led to many bugs. We have replaced it by a smaller, simpler, applicative flow graph based on Huet...
متن کاملUsing an Imperative Language to Teach Applicative Methods
Many universities teach traditional, imperative languages in their introductory programming courses, even though an applicative language may be preferable. In this paper, we present a compromise and show how applicative programming methods may be illustrated eeectively using a subset of Pascal. The approach focuses on order of evaluation, the if statement, functions, and recursion. We discuss s...
متن کاملA Linear Applicative Solution for the Set Union Problem
This paper is about an applicative solution to the IMPERATIVE Set Union Problem, as posed by Peyton-Jones [3]. The adjectivisation is used here to emphasise that the problem was thought to pose significant questions in finding an applicative solution of the same order of complexity as the imperative version. We show one such solution, written in the style of KRC [5]. The same reasoning, when ap...
متن کامل